Helly-type Theorems for Infinite and for Finite Intersections of Sets Starshaped via Staircase Paths
نویسنده
چکیده
Let d be a fixed integer, 0 ≤ d ≤ 2, and let K be a family of simply connected sets in the plane. For every countable subfamily {Kn : n ≥ 1} of K, assume that ∩{Kn : n ≥ 1} is starshaped via staircase paths and that its staircase kernel contains a convex set of dimension at least d. Then ∩{K : K in K} has these properties as well. For the finite case, define function f on {0, 1} by f(0) = 3, f(1) = 4. Let K = {Ki : 1 ≤ i ≤ n} be a finite family of compact sets in the plane, each having connected complement. For d fixed, d {0, 1}, and for every f(d) members of K, assume that the corresponding intersection is starshaped via staircase paths and that its staircase kernel contains a convex set of dimension at least d. Then ∩{Ki : 1 ≤ i ≤ n} has these properties, also. There is no analogous Helly number for the case in which d = 2. Each of the results above is best possible. MSC 2000: 52.A30, 52.A35
منابع مشابه
Helly-Type Theorems for Countable Intersections of Planar Sets Starshaped via Polygonal k-Paths
Let k be a fixed integer, k ≥ 1, and let K be a family of simply connected sets in the plane. 1) If every countable intersection of members of K is starshaped via (at most) k-paths and the corresponding k-order kernel has nonempty interior, then ∩{K : K inK} has these properties as well. 2) When members of K are closed, if every countable intersection of members of K is starshaped via (at most)...
متن کاملOn starshapedness in products of interval spaces
Later a bouquet of Krasnosel 'skii-type theorems was discovered; see [1,2, 3, 4,16,17]. Apart from the usual line segment visibility and starshapedness several other notions of starshaped set and visibility have been investigated in the past years: d-starshaped sets in metric and normed spaces [14,15,16,17], starshaped sets in graphs [14,171, staircase visibility [5,10,12], rectangular visibili...
متن کاملIntersection patterns of convex sets via simplicial complexes, a survey
The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called d-representable, d-collapsible and d-Leray simplicial complexes which are very useful for this study. We study the differences among these notions and we also focus ...
متن کاملTransversal and Helly-type Theorems in Geometry, Combinatorics and Topology
Helly’s theorem also holds for infinite families of compact convex sets, and has stimulated numerous generalization and variants. Results of the type “if every m members of a family of objects have property P then the entire family has the property P” are called Helly-type theorems. The minimum positive integer m that makes this theorem possible is called the Helly number. Helly-type theorems h...
متن کاملDiscrete and Lexicographic Helly Theorems and their Relations to LP-Type Problems
Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in IR have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems where the common point should belong to an a-priori given set, lexicographic Helly theorems where the common point should not be lexicographically g...
متن کامل